Comparison of Integer Programming (IP) Solvers for Automated Test Assembly (ATA)
نویسندگان
چکیده
منابع مشابه
برنامه‌ریزی درسی در دانشگاه به کمک مدل‌سازی دو مرحله‌ای برنامه‌ریزی ریاضی
In the university timetabling problem, necessity of considering variables corresponding to lessons, teachers, classes, days of the week and hours bring about a large scale mix integer linear programming problem. Usually the problem is so big that the exact mathematical programming solvers can not solve them in a small period of time. So variety of heuristic algorithms is proposed to solve such...
متن کاملAutomated Configuration of Mixed Integer Programming Solvers
State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. We study the application of an automated algorithm configuration procedure to different MIP solvers, instance types and optimization objectives. We show that this fully-automated process y...
متن کاملComparison of IP and CNF Models for Control of Automated Valet Parking Systems
In automated valet parking system, a central computer controls a number of robots which have the capability to move in two directions, under cars, lift a car up, carry it to another parking slot, and drop it. We study the theoretical throughput limitations of these systems: Given a car park layout, an initial configuration of a car park (location of cars, robots), into a desired, terminal confi...
متن کاملComparison of Some High-Performance MINLP Solvers
In this paper some high-performance mixed integer non-linear programming (MINLP) solvers in GAMS (General Algebraic Modeling System) are evaluated. AlphaECP, Baron, Dicopt and SBB are the MINLP (mixed integer non-linear programming) solvers in focus. A large test set with 250 problems is used and special attention is given to a new GAMS solver, GAMS/AlphaECP, which has recently been included in...
متن کاملEffective Algorithms for the Satisfiability of Quantifier-Free Formulas Over Linear Real and Integer Arithmetic
A core technique of modern tools for formally reasoning about computing systems is generating and dispatching queries to automated theorem provers, including Satisfiability Modulo Theories (SMT) provers. SMT provers aim at the tight integration of decision procedures for propositional satisfiability and decision procedures for fixed first-order theories – known as theory solvers. This thesis pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015